Tilt stability in nonlinear programming under Mangasarian-Fromovitz constraint qualification
نویسندگان
چکیده
The paper concerns the study of tilt stability of local minimizers in standard problems of nonlinear programming. This notion plays an important role in both theoretical and numerical aspects of optimization and has drawn a lot of attention in optimization theory and its applications, especially in recent years. Under the classical Mangasarian–Fromovitz Constraint Qualification, we establish relationships between tilt stability and some other stability notions in constrained optimization. Involving further the well-known Constant Rank Constraint Qualification, we derive new necessary and sufficient conditions for tilt-stable local minimizers.
منابع مشابه
Constraint Qualifications and KKT Conditions for Bilevel Programming Problems
In this paper we consider the bilevel programming problem (BLPP), which is a sequence of two optimization problems where the constraint region of the upper-level problem is determined implicitly by the solution set to the lower-level problem. We extend well-known constraint qualifications for nonlinear programming problems such as the Abadie constraint qualification, the Kuhn-Tucker constraint ...
متن کاملStabilized Sequential Quadratic Programming
Recently, Wright proposed a stabilized sequential quadratic programming algorithm for inequality constrained optimization. Assuming the Mangasarian-Fromovitz constraint qualification and the existence of a strictly positive multiplier (but possibly dependent constraint gradients), he proved a local quadratic convergence result. In this paper, we establish quadratic convergence in cases where bo...
متن کاملOn the Constant Positive Linear Dependence Condition and Its Application to SQP Methods
In this paper, we introduce a constant positive linear dependence condition (CPLD), which is weaker than the Mangasarian–Fromovitz constraint qualification (MFCQ) and the constant rank constraint qualification (CRCQ). We show that a limit point of a sequence of approximating Karush–Kuhn–Tucker (KKT) points is a KKT point if the CPLD holds there. We show that a KKT point satisfying the CPLD and ...
متن کاملBoundedness of KKT Multipliers in fractional programming problem using convexificators
‎In this paper, using the idea of convexificators, we study boundedness and nonemptiness of Lagrange multipliers satisfying the first order necessary conditions. We consider a class of nons- mooth fractional programming problems with equality, inequality constraints and an arbitrary set constraint. Within this context, define generalized Mangasarian-Fromovitz constraint qualification and sh...
متن کاملMultiplier Rules Under Mixed Assumptions of Differentiability and Lipschitz Continuity
In this paper we study nonlinear programming problems with equality, inequality, and abstract constraints where some of the functions are Fréchet differentiable at the optimal solution, some of the functions are Lipschitz near the optimal solution, and the abstract constraint set may be nonconvex. We derive Fritz John type and Karush–Kuhn–Tucker (KKT) type first order necessary optimality condi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Kybernetika
دوره 49 شماره
صفحات -
تاریخ انتشار 2013